An improved bound on correlation between polynomials over Z_m and MOD_q

نویسنده

  • Arkadev Chattopadhyay
چکیده

Let m, q > 1 be two integers that are co-prime and A be any subset of Zm. Let P be any multi-variate polynomial of degree d in n variables over Zm. We show that the MODq boolean function on n variables has correlation at most exp(−Ω(n/(m2 ))) with the boolean function f defined by f(x) = 1 iff P (x) ∈ A for all x ∈ {0, 1}. This improves on the bound of exp(−Ω(n/(m2))) obtained in the breakthrough work of Bourgain [3] and Green et al. [9]. Our calculation is also slightly shorter than theirs. Our result immediately implies the bound of exp(−Ω(n/4)) for the special case of m = 2. This bound was first reported in the recent work of Viola [11]. [11] states that it is not clear how to extend their method to general m.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A spectral method based on Hahn polynomials for solving weakly singular fractional order integro-differential equations

In this paper, we consider the discrete Hahn polynomials and investigate their application for numerical solutions of the fractional order integro-differential equations with weakly singular kernel .This paper presented the operational matrix of the fractional integration of Hahn polynomials for the first time. The main advantage of approximating a continuous function by Hahn polynomials is tha...

متن کامل

An improved infeasible‎ ‎interior-point method for symmetric cone linear complementarity‎ ‎problem

We present an improved version of a full Nesterov-Todd step infeasible interior-point method for linear complementarityproblem over symmetric cone (Bull. Iranian Math. Soc., 40(3), 541-564, (2014)). In the earlier version, each iteration consisted of one so-called feasibility step and a few -at most three - centering steps. Here, each iteration consists of only a feasibility step. Thus, the new...

متن کامل

On the combinatorial and algebraic complexity of Quanti erEliminationS

In this paper we give a new algorithm for performing quantiier elimination from rst order formulae over real closed elds. This algorithm improves the complexity of the asymptotically fastest algorithm for this problem, known to this date. A new feature of our algorithm is that the role of the algebraic part (the dependence on the degrees of the input polynomials) and the combinatorial part (the...

متن کامل

New correlation bounds for GF(2) polynomials using Gowers uniformity

We study the correlation between low-degree GF (2) polynomials p and explicit functions. Our main results are the following: I We prove that theModm function on n bits has correlation at most exp ( −Ω ( n/4d )) with any GF (2) polynomial of degree d, for any fixed odd integer m. This improves on the previous exp ( −Ω ( n/8d )) bound by Bourgain (C. R. Acad. Sci. Paris, 2005) and Green et al. (C...

متن کامل

Using an Imperialistic Competitive Algorithm in Global Polynomials Optimization (Case Study: 2D Geometric Correction of IKONOS and SPOT Imagery)

The number of high resolution space imageries in photogrammetry and remote sensing society is growing fast. Although these images provide rich data, the lack of sensor calibration information and ephemeris data does not allow the users to apply precise physical models to establish the functional relationship between image space and object space. As an alternative solution, some generalized mode...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Electronic Colloquium on Computational Complexity (ECCC)

دوره 13  شماره 

صفحات  -

تاریخ انتشار 2006